Time Efficient Greedy Strategy for Scheduling Trains on a Line
نویسندگان
چکیده
Scheduling trains on a single railway line is an issue in it own right, and is a building block for scheduling trains in railway networks. A local, state dependent, travel advance strategy combined with a discrete event model of a railway line represent a more efficient way of approaching the scheduling problem than nonlinear programming approaches used in the past. The approach also eliminates a deficiency of nonlinear programming formulations, which produce a programmed schedule that cannot be applied if any perturbation in train operations occurs. Copyright © 2002 IFAC.
منابع مشابه
Energy Efficient Strategies for Scheduling Trains on a Line*
Scheduling trains on a single railway line is treated by converting the scheduling problem to a discrete event dynamic system, and converting a greedy time-efficient strategy to an energy efficient schedule. While such a schedule cannot be referred to as a strategy dependent solely on the state of the system the strategy is easily re-computed when perturbations in the nominal schedule occur. Co...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملEfficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine
Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...
متن کاملConcurrent Locomotive Assignment and Freight Train Scheduling
The locomotive assignment and the freight train scheduling are important problems in railway transportation. Freight cars are coupled to form a freight rake. The freight rake becomes a train when a locomotive is coupled to it. The locomotive assignment problem assigns locomotives to a set of freight rakes in a way that, with minimum locomotive deadheading time, rake coupling delay and locomotiv...
متن کاملDynamic Cargo Trains Scheduling for Tackling Network Constraints and Costs Emanating from Tardiness and Earliness
This paper aims to develop a multi-objective model for scheduling cargo trains faced by the costs of tardiness and earliness, time limitations, queue priority and limited station lines. Based upon the Islamic Republic of Iran Railway Corporation (IRIRC) regulations, passenger trains enjoy priority over other trains for departure. Therefore, the timetable of cargo trains must be determined based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002